Steiner almost self-complementary graphs and halving near-Steiner triple systems

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Steiner almost self-complementary graphs and halving near-Steiner triple systems

We show that for every admissible order v ≡ 0 or 2 (mod 6) there exists a near-Steiner triple system of order v that can be halved. As a corollary we obtain that a Steiner almost self-complementary graph with n vertices exists if and only if n ≡ 0 or 2 (mod 6). © 2008 Elsevier B.V. All rights reserved.

متن کامل

Steiner Triple Systems and Existentially Closed Graphs

We investigate the conditions under which a Steiner triple system can have a 2or 3-existentially closed block intersection graph.

متن کامل

Representing graphs in Steiner triple systems - II

Let G = (V,E) be a simple graph and let T = (P,B) be a Steiner triple system. Let φ be a one-to-one function from V to P . Any edge e = {u, v} has its image {φ(u), φ(v)} in a unique block in B. We also denote this induced function from edges to blocks by φ. We say that T represents G if there exists a one-to-one function φ : V → P such that the induced function φ : E → B is also one-to-one; tha...

متن کامل

Bicolour graphs of Steiner triple systems

In this paper we introduce the notion of a bicolour graph of a Steiner triple system. Given an arbitrary colouring of the points of a Steiner triple system, the bicolour graph is the graph obtained on the point set of the system by placing an edge between two points if they have the same colour and appear in a triple with a point of a di4erent colour. The case where the graph is Kv was partiall...

متن کامل

Block-Intersection Graphs of Steiner Triple Systems

A Steiner triple system of order n is a collection of subsets of size three, taken from the n-element set {0, 1, ..., n−1}, such that every pair is contained in exactly one of the subsets. The subsets are called triples, and a block-intersection graph is constructed by having each triple correspond to a vertex. If two triples have a non-empty intersection, an edge is inserted between their vert...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 2009

ISSN: 0012-365X

DOI: 10.1016/j.disc.2008.04.006